A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions

نویسنده

  • Tomás Masopust
چکیده

This paper answers three open questions concerning the generative power of some simple variants of context-free grammars regulated by context conditions. Specifically, it discusses the generative power of so-called contextfree semi-conditional grammars (which are random context grammars where permitting and forbidding sets are replaced with permitting and forbidding strings) where permitting and forbidding strings of each production are of length no more than one, and of simple semi-conditional grammars where, in addition, no production has attached both a permitting and a forbidding string. Finally, this paper also presents some normal form results, an overview of known results, and unsolved problems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Grammars with Regulated Rewriting

Context-free grammars are not able to cover all linguistic phenomena. Thus we define some types of grammars where context-free rules are used and restriction imposed on the derivations. We illustrate the concepts by example, compare the generative power, give some closure and decidability properties and basic facts on syntactic complexity.

متن کامل

A Note on the Cooperation in Rewriting Systems with Context-Dependency Checking

Extended Abstract Rewriting systems based on simple forms of productions play an important role in formal language theory. Therefore, it is no surprise that context-free grammars and their modifications are one of the most studied models. However, many of the systems describing practically interesting applications, such as the parsers of natural and programming languages, require additional mec...

متن کامل

Some Remarks on the Generative Power of Collage Grammars and Chain-Code Grammars

Collage grammars and context-free chain-code grammars are compared with respect to their generative power. It is shown that the generated classes of line-drawing languages are incomparable, but that chain-code grammars can simulate collage grammars that use only similarity transformations.

متن کامل

Graph grammars with string-regulated rewriting

Multicellular organisms undergo a complex developmental process, orchestrated by the genetic information in their cells, in order to form a newborn individual from a fertilized egg. This complex process, not completely understood yet, is believed to have a key role in generating the impressive biotic diversity of organisms found on earth. Inspired by mechanisms of Eukaryotic genetic expression,...

متن کامل

Sequential grammars and automata with valences

We discuss the model of valence grammars, a simple extension of context-free grammars. We show closure properties of context-free valence languages over arbitrary monoids. Chomsky and Greibach normal form theorems and an iteration lemma for context-free valence grammars over the groups Z are proved. The generative power of di4erent control monoids is investigated. In particular, we show that co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009